ERRATUM: "RANDOMIZED PARALLEL ALGORITHMS FOR TRAPEZOIDAL DIAGRAMS"

Optimal Parallel Randomized Algorithms for . . .

Randomized parallel algorithms

1 Outline of the chapter Advances in modern circuit technology have made parallel computation an intriguing possibility, pushing the limits of what can pratically be computed. Relevant applications of parallel computing have been succesfully developped in the eld of combinatorial optimization. Unfortunately, the theory of computational complexity has established that several relevant problems i...

Randomized Parallel Algorithms for Combinatorial Optimization

In this paper we show some important randomization techniques for the parallel processing of discrete problems. In particular, we present several parallel randomized algorithms frequently used for sorting, packet routing, shortest paths problems, matching problems, depth rst search, minimum cost spanning trees, and maximal independent set problems. We also discuss the connection between randomi...

Algorithms for Greechie Diagrams

We give a new algorithm for generating Greechie diagrams with arbitrary chosen number of atoms or blocks (with 2, 3, 4, . . . atoms) and provide a computer program for generating the diagrams. The results show that the previous algorithm does not produce every diagram and that it is at least 105 times slower. We also provide an algorithm and programs for checking Greechie diagram passage by equ...

Revisiting Randomized Parallel Load Balancing Algorithms

We deal with the well studied allocation problem of assigning n balls to n bins so that the maximum number of balls assigned to the same bin is minimized. We focus on randomized, constantround, distributed, asynchronous algorithms for this problem. Adler et al. [1] presented lower bounds and upper bounds for this problem. A similar lower bound appears in Berenbrink et al. [3]. The lower bound i...